Permanental Mates: Perturbations and Hwang's conjecture
نویسندگان
چکیده
Let Ωn denote the set of all n × n doubly stochastic matrices. Two unequal matrices A and B in Ωn are called permanental mates if the permanent function is constant on the line segment t A + (1 − t)B, 0 ≤ t ≤ 1, connecting A and B. We study the perturbation matrix A + E of a symmetric matrix A in Ωn as a permanental mate of A. Also we show an example to disprove Hwang’s conjecture, which states that, for n ≥ 4, any matrix in the interior of Ωn has no permanental mate. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
A Maximal Eigenvalue Conjecture Equivalent to Permanental Dominance
Using concepts from the character theory of finite groups, it is shown that Lieb's Permanental Dominance Conjecture is equivalent to a certain maximal eigenvalue conjecture.
متن کاملOn Permanental Polynomials of Certain Random Matrices
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided for several random matrix ensembles. When compared with the corresponding formulae for characteristic polynomials, our results show both striking similarities...
متن کاملA note on the permanental roots of bipartite graphs
It is well-known that any graph has all real eigenvalues and a graph is bipartite if and only if its spectrum is symmetric with respect to the origin. We are interested in finding whether the permanental roots of a bipartite graph G have symmetric property as the spectrum of G. In this note, we show that the permanental roots of bipartite graphs are symmetric with respect to the real and imagin...
متن کاملComputing the Permanental Polynomial of C 60 in Parallel ∗
The permanental polynomial of buckminsterfullerene C60 is computed in parallel in this paper. The basic idea of the method is simply divide-and-conquer to achieve both computational precision and speed. The load balancing strategies for the permanental polynomial computation are further improved with the help of the theory of parallel machine scheduling in combinatorial optimization. The specia...
متن کاملProperties and simulation of α-permanental random fields
An α-permanental random field is briefly speaking a model for a collection of random variables with positive associations, where α is a positive number and the probability generating function is given in terms of a covariance or more general function so that density and moment expressions are given by certain α-permanents. Though such models possess many appealing probabilistic properties, many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 21 شماره
صفحات -
تاریخ انتشار 2008